Cover time of a random graph with given degree sequence
نویسندگان
چکیده
منابع مشابه
Cover time of a random graph with given degree sequence
In this paper we establish the cover time of a random graph G(d) chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence d. We show that under certain restrictions on d, the cover time of G(d) is whp asymptotic to d−1 d−2 θ dn log n. Here θ is the average degree and d is the effective minimum degree.
متن کاملCover time of a random graph with given degree sequence II: Dealing with vertices of degree two
In this paper we establish the cover time of a random graph Gd chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence d = (d1 ≤ d2 ≤ · · · ≤ dn ≤ no(1)). In a previous paper [1] we made a number of assumptions about Gd, the most significant being the assumption that d1 ≥ 3. In this paper we continue this line of research and only assume that d1 ≥ 2.
متن کاملCover time of a random graph with a degree sequence II: Allowing vertices of degree two
We study the cover time of a random graph chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence d = (di) n i=1. In a previous work [1], the asymptotic cover time was obtained under a number of assumptions on d, the most significant being that di ≥ 3 for all i. Here we replace this assumption by di ≥ 2. As a corollary, we establish the asymptotic cover time fo...
متن کاملRandom graphs with a given degree sequence
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in the sense of Lovász and Szegedy with identifiable limits. This allows simple determination of other features such as the number of triangles. ...
متن کاملGraph Editing to a Given Degree Sequence
We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence, where the aim is to obtain a graph with a given degree sequence σ by at most k vertex or edge deletions and edge additions. We show that the problem is W[1]-hard when parameterized by k for any combination of the allowed editing operations. From the positive side, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.07.006